Kemeny ranking aggregation meets the GPU

Abstract Ranking aggregation, studied in the field of social choice theory, focuses on combination information with aim determining a winning ranking among some alternatives when preferences voters are expressed by ordering possible from most to least preferred. One famous aggregation methods can be traced back 1959, Kemeny introduces measure distance between and opinion gathered profile rankings. Using this, he proposed elect as election one that minimizes profile. This is factorial number alternatives, posing handicap runtime algorithms developed find ranking, which prevents its use real problems where large. In this work we introduce first algorithm for problem designed executed Graphical Processing Unit. The threads identifiers codified associated rankings means system, radix numeral system then used uniquely pair thread using Lehmer’s code. Results guarantee constant execution time up 14 alternatives.